Lippmann–Schwinger–Lanczos algorithm for inverse scattering problems

A parallel radial bisection algorithm for inverse scattering problems

the algorithm for solving the inverse numerical range problem

برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.

Marching schemes for inverse acoustic scattering problems

Since supp f ⊂ Ω, uθ satisfies the plain Helmholtz equation with constant wavenumber outside of Ω, the radiation condition and uθ|∂Ω = gθ. So by solving the exterior problem of the Helmholtz equation (analytically if Ω is a circle), uθ can be computed everywhere outside of Ω without prior knowledge of f . In particular, we can compute h = ∂uθ ∂ν on ∂Ω. Thus, our original problem can be rewritte...

Inverse Medium Scattering Problems for Electromagnetic Waves

Consider a time-harmonic electromagnetic plane wave incident on a medium enclosed by a bounded domain in R3. In this paper, existence and uniqueness of the variational problem for forward scattering are established. An energy estimate for the scattered field with a uniform bound with respect to the wavenumber is obtained in the case of low frequency on which the Born approximation is based. A c...

Inverse scattering problems for first - order systems

In this thesis, the Zakharov-Shabat scattering problem and several types of Landau-Lifschitz scattering problems are considered. The inverse scattering problem is that of seeking one or more coefficients in a system of differential equation from the scattering data which, generally, consists of a reflection coefficient and bound state data. We assume mainly that the coefficients to be determine...